Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets
نویسندگان
چکیده
We consider the problem of performing polygonal map overlay and the re nement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with arti cial and real-world data sets helps to identify the algorithm that should be used for given input data.
منابع مشابه
In-Memory Spatial Join: The Data Matters!
A spatial join computes all pairs of spatial objects in two data sets satisfying a distance constraint. An increasing demand in applications ranging from human brain analysis to transportation data analysis motivates studies on designing new in-memory spatial join algorithms. Among recent proposals, the following six algorithms can efficiently perform in-memory spatial joins: Size Separation Sp...
متن کاملIndexed Map-Reduce Join Algorithm
Map Reduce is used to handle and support massive data sets .rabidly increasing in data size, and big data are imperative today to make an analysis of this data. Map-Reduce gets more helpful information by using two simple functions map and reduce with load balancing, fault tolerance, and high scalability .the most important operation in the analysis process is join. This paper explains new two-...
متن کاملLoad Balancing in High Performance GIS: Declustering Polygonal Maps
A high performance geographic information system (GIS) is a central component of many real-time applications of spatial decision making. The GIS may contain gigabytes of geometric and feature data (e.g. location, elevation, soil type etc.) stored on a hierarchy of memory devices and represented as grids and large sets of polygons. The data is often accessed via range queries (like polygon clipp...
متن کاملTo appear in SIGMOD 1996 1 Partition Based Spatial – Merge Join
This paper describes PBSM (Partition Based Spatial–Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join are intermediate results in a complex query, or in a parallel environment where the inputs must be dynamicall...
متن کاملAn Effective High-Performance Multiway Spatial Join Algorithm with Spark
Multiway spatial join plays an important role in GIS (Geographic Information Systems) and their applications. With the increase in spatial data volumes, the performance of multiway spatial join has encountered a computation bottleneck in the context of big data. Parallel or distributed computing platforms, such as MapReduce and Spark, are promising for resolving the intensive computing issue. P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999